On γ-Vectors Satisfying the Kruskal–Katona Inequalities
نویسندگان
چکیده
منابع مشابه
On Γ-vectors Satisfying Kruskal-katona Inequalities
We present examples of flag homology spheres whose γvectors satisfy the Kruskal-Katona inequalities. This includes several families of well-studied simplicial complexes, including Coxeter complexes and the simplicial complexes dual to the associahedron and to the cyclohedron. In another direction, we show that if a flag (d− 1)-sphere has at most 2d + 2 vertices its γ-vector satisfies the Kruska...
متن کاملOn γ-Vectors Satisfying the Kruskal-Katona Inequalities
We present examples of flag homology spheres whose γvectors satisfy the Kruskal-Katona inequalities. This includes several families of well-studied simplicial complexes, including Coxeter complexes and the simplicial complexes dual to the associahedron and to the cyclohedron. In these cases, we construct explicit simplicial complexes whose f -vectors are the γ-vectors in question. In another di...
متن کاملOn Manifolds Satisfying Stable Systolic Inequalities
We show that for closed orientable manifolds the k-dimensional stable systole admits a metric-independent volume bound if and only if there are cohomology classes of degree k that generate cohomology in top-degree. Moreover, it turns out that in the nonorientable case such a bound does not exist for stable systoles of dimension at least two. Additionally, we prove that the stable systolic const...
متن کاملOn Spatial Adaptive Nonparametric Estimation of Functions Satisfying Differential Inequalities
The paper is devoted to developing spatial adaptive estimates of the signals satisfying linear differential inequalities with unknown differential operator of a given order. The classes of signals under consideration cover a wide variety of classes usual in the nonparametric regression problem; moreover, they contain the signals whose parameters of smoothness are not uniformly bounded, even loc...
متن کاملSatisfying Subtype Inequalities in Polynomial Space
This paper studies the complexity of type inference in-calculus with subtyping. Type inference is equivalent to solving systems of subtype inequalities. We consider simple types ordered structurally from an arbitrary set of base subtype assumptions. In this case, we give a PSPACE upper bound. Together with the known lower bound, this result settles completely the complexity of type inference ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2010
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-010-9243-6